On Pattern Classification Using Statistical Moments
نویسنده
چکیده
Selecting appropriate feature extraction method is absolutely one of the most important factors to archive high classification performance in pattern recognition systems. Among different feature extraction methods proposed for pattern recognition, statistical moments seem to be so promising. Whereas theoretical comparison of the moments is too complicated, in this paper, an experimental evaluation on four well known statistical moments namely Hu invariant moments, Affine invariant moments, Zernike moments, and Pseudo-Zernike moments is presented. Set of different experiments on a binary images dataset consisting of regular, translated, rotated, and scaled Persian printed numerical characters using a nearest neighbor rule classifier has been done and variety of interesting results have been presented. Finally, the results show that Pseudo-Zernike moments outperform the other introduced moments.
منابع مشابه
Classification of CT liver images using local binary pattern with Legendre moments
Liver cancer leads to more number of human deaths nowadays. Patient survival chances can be increased by early detection of the tumour. Texture analysis based on moment features for CT liver scan images is proposed here. The texture feature is extracted by local binary pattern and statistical features are extracted by Legendre moments. This communication presents a comparative analysis between ...
متن کاملStatistical Moments based Noise Classification using Feed Forward Back Propagation Neural Network
A neural network classification based noise identification method is presented by isolating some representative noise samples, and extracting their statistical features for noise type identification. The isolation of representative noise samples is achieved using prevalent used image filters whereas noise identification is performed using statistical moments features based classification system...
متن کاملImage analysis by discrete orthogonal dual Hahn moments
In this paper, we introduce a set of discrete orthogonal functions known as dual Hahn polynomials. The Tchebichef and Krawtchouk polynomials are special cases of dual Hahn polynomials. The dual Hahn polynomials are scaled to ensure the numerical stability, thus creating a set of weighted orthonormal dual Hahn polynomials. They are allowed to define a new type of discrete orthogonal moments. The...
متن کاملStatistical binary pattern and post-competitive representation for pattern recognition
During the last decade, sparse representations have been successfully applied to design highperforming classification algorithms such as the classical sparse representation based classification (SRC) algorithm. More recently, collaborative representation based classification (CRC) has emerged as a very powerful approach, especially for face recognition. CRC takes advantage of sparse representat...
متن کاملDigital modulation classification using power moment matrices
With the rising number of modulation types used in multi-user and multi-service digital communication systems, the need to find efficient methods for their discrimination in the presence of noise has become increasingly important. Here, we present a new approach based on a recently developed pattern recognition method previously applied to word spotting problems in binary images [?]. In this ap...
متن کامل